Geometric graph theory

Results: 190



#Item
11Straight-line Drawings of 1-planar Graphs Peter Eades1 , Seok-Hee Hong1 , Giuseppe Liotta2 , and Sheung-Hung Poon3 1 3

Straight-line Drawings of 1-planar Graphs Peter Eades1 , Seok-Hee Hong1 , Giuseppe Liotta2 , and Sheung-Hung Poon3 1 3

Add to Reading List

Source URL: www.cs.usyd.edu.au

Language: English - Date: 2011-06-06 12:14:24
12Geometric Ad-Hoc Routing: Of Theory and Practice

Geometric Ad-Hoc Routing: Of Theory and Practice

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:48
13Typical distances in a geometric model for complex networks ∗ Mohammed Amin Abdullah† Michel Bode‡

Typical distances in a geometric model for complex networks ∗ Mohammed Amin Abdullah† Michel Bode‡

Add to Reading List

Source URL: web.mat.bham.ac.uk

Language: English - Date: 2015-06-25 12:56:44
14121  Doc. Math. J. DMV On the Construction of the Kan Loop Group Friedhelm Waldhausen

121 Doc. Math. J. DMV On the Construction of the Kan Loop Group Friedhelm Waldhausen

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2014-07-13 07:29:13
15EGC 2013 PROGRAM Wednesday June 26, :30-17:00 Coffee break 08:00-09:00 Conference registration 09:00-09:30 Welcome and opening speech

EGC 2013 PROGRAM Wednesday June 26, :30-17:00 Coffee break 08:00-09:00 Conference registration 09:00-09:30 Welcome and opening speech

Add to Reading List

Source URL: congreso.us.es

Language: English - Date: 2013-06-20 13:51:57
16A semidefinite programming hierarchy for geometric packing problems David de Laat (TU Delft) Joint work with Frank Vallentin (Universit¨at zu K¨oln)  Isaac Newton Institute for Mathematical Sciences – July 2013

A semidefinite programming hierarchy for geometric packing problems David de Laat (TU Delft) Joint work with Frank Vallentin (Universit¨at zu K¨oln) Isaac Newton Institute for Mathematical Sciences – July 2013

Add to Reading List

Source URL: www.daviddelaat.nl

Language: English
17COMPLEXITY AND APPROXIMABILITY OF THE COVER POLYNOMIAL ¨ser, Holger Dell, and Mahmoud Fouz Markus Bla  Abstract. The cover polynomial and its geometric version introduced by Chung & Graham and D’Antona & Munarini, res

COMPLEXITY AND APPROXIMABILITY OF THE COVER POLYNOMIAL ¨ser, Holger Dell, and Mahmoud Fouz Markus Bla Abstract. The cover polynomial and its geometric version introduced by Chung & Graham and D’Antona & Munarini, res

Add to Reading List

Source URL: www-cc.cs.uni-saarland.de

Language: English - Date: 2014-01-17 04:55:28
18MATH 5340 — Discrete Random Structures Assignment 9 Due Monday, November 30 (before class) 1. Consider the Random Geometric Graph RGG(S, n, r), where S is the unit square. In many results about this graph, the graph is

MATH 5340 — Discrete Random Structures Assignment 9 Due Monday, November 30 (before class) 1. Consider the Random Geometric Graph RGG(S, n, r), where S is the unit square. In many results about this graph, the graph is

Add to Reading List

Source URL: www.mscs.dal.ca

Language: English - Date: 2015-11-27 15:27:22
19Border effects in ad-hoc networks  Carl P. Dettmann (University of Bristol) with Justin P. Coon (Oxford) and Orestis Georgiou (Toshiba)

Border effects in ad-hoc networks Carl P. Dettmann (University of Bristol) with Justin P. Coon (Oxford) and Orestis Georgiou (Toshiba)

Add to Reading List

Source URL: www.monmeetings.org

Language: English - Date: 2015-09-16 12:56:16
20Entropy of Random Geometric Graphs Justin P. Coon with thanks to N. Warsi, O. Georgiou and C. P. Dettmann 21 September, 2015

Entropy of Random Geometric Graphs Justin P. Coon with thanks to N. Warsi, O. Georgiou and C. P. Dettmann 21 September, 2015

Add to Reading List

Source URL: www.monmeetings.org

Language: English - Date: 2015-09-17 12:42:52